Soliton automata
نویسندگان
چکیده
منابع مشابه
Quantization of Soliton Cellular Automata
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian describing a quantum chain model is constructed. The intrinsic parallelism of QSCA, a phenomenon first known from quantum computers, is also emphasized.
متن کاملParticles in Soliton Cellular Automata
An initial configurat ion of the filter cellular automaton introduced by Park, Steiglitz, and Thurston can be thought of as consisting of a number of particles. Here we present a complet e analysis of the evolution of single particles. In particular, conditions are given for th e existence of periodic particles, and the period is computed in terms of the initial data.
متن کاملSoliton automata with constant external edges
Soliton automata are the mathematical models of certain possible molecular switching devices. Both from theoretical and practical point of view, it is a central question to describe soliton automata with constant external edges. Extending a result of Dassow and Jürgensen, we characterize soliton automata in this special case.
متن کاملSome Remarks on A ( 1 ) 1 Soliton Cellular Automata
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these...
متن کامل0 Some remarks on A ( 1 ) 1 soliton cellular automata
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1990
ISSN: 0022-0000
DOI: 10.1016/0022-0000(90)90010-i